Generating Defeasible Knowledge Bases from Real-World Argumentations using D-BAS

نویسنده

  • Daniel Neugebauer
چکیده

d-bas is an open-source web tool for dialog-based online argumentation among non-expert human users [7]. In this work, we present dabasco, a d-bas module that allows to automatically export d-bas discussions, interpreted as defeasible knowledge bases, into formats of three well-established argumentation models: abstract Argumentation Frameworks, the ASPIC Framework, and Abstract Dialectical Frameworks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incorporating Defeasible Knowledge and Argumentative Reasoning in Web-based Forms

The notion of forms as a way of organizing and presenting data has long been used since the beginning of the WWW. Web-based forms have evolved together with the development of new markup languages (e.g., XML), in which it is possible to provide validation scripts as part of the form code in order to test whether the intended meaning of the form is correct. However, for the form designer, part o...

متن کامل

A Neo-Topological Approach to Reasoning on Ontologies with Exceptions and Comparison with Defeasible Description Logics

This article compares Defeasible Description Logics (DDL) and Topological Approach to reason on Ontologies with exceptions. DDL is integration between Description Logics and Defeasible Logics to deal with monotonic and non-monotonic parts of the knowledge bases respectively. Topological approach tries to reason on inconsistent knowledge bases using the conventional topological operators e.g., i...

متن کامل

Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases

In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable models, are not given up. The proposed algorithms exploit the structural information of defeasible knowledge bases to facilitate efficient computational models.

متن کامل

A Logic Programming Framework for Possibilistic Argumentation with Vague Knowledge

Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Defeasible Logic Programming (DeLP) is a defeasible argumentation formalism based on an extension of logic programming. Although DeLP has been successfully integrated in a number of different real-world applications, D...

متن کامل

Belief Revision in Structured Probabilistic Argumentation Model and Application to Cyber Security

In real-world applications, knowledge bases consisting of all the available information for a specific domain, along with the current state of affairs, will typically contain contradictory data, coming from different sources, as well as data with varying degrees of uncertainty attached. An important aspect of the effort associated with maintaining such knowledge bases is deciding what informati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017